75 research outputs found
Squares and difference sets in finite fields
For infinitely many primes p = 4k+1 we give a slightly
improved upper bound for the maximal cardinality of a set B â Z
p
such that the difference set BâB contains only quadratic residues.
Namely, instead of the âtrivialâ bound |B| †âp we prove |B âp | †â 1, under suitable conditions on p. The new bound is valid
for approximately three quarters of the primes p = 4k + 1
Unitary designs and codes
A unitary design is a collection of unitary matrices that approximate the
entire unitary group, much like a spherical design approximates the entire unit
sphere. In this paper, we use irreducible representations of the unitary group
to find a general lower bound on the size of a unitary t-design in U(d), for
any d and t. We also introduce the notion of a unitary code - a subset of U(d)
in which the trace inner product of any pair of matrices is restricted to only
a small number of distinct values - and give an upper bound for the size of a
code of degree s in U(d) for any d and s. These bounds can be strengthened when
the particular inner product values that occur in the code or design are known.
Finally, we describe some constructions of designs: we give an upper bound on
the size of the smallest weighted unitary t-design in U(d), and we catalogue
some t-designs that arise from finite groups.Comment: 25 pages, no figure
New upper bounds for kissing numbers from semidefinite programming
Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions. In particular our computations give the (known) values for the cases n = 3, 4, 8, 24
Tight p-fusion frames
Fusion frames enable signal decompositions into weighted linear subspace
components. For positive integers p, we introduce p-fusion frames, a sharpening
of the notion of fusion frames. Tight p-fusion frames are closely related to
the classical notions of designs and cubature formulas in Grassmann spaces and
are analyzed with methods from harmonic analysis in the Grassmannians. We
define the p-fusion frame potential, derive bounds for its value, and discuss
the connections to tight p-fusion frames
Spectral approach to linear programming bounds on codes
We give new proofs of asymptotic upper bounds of coding theory obtained
within the frame of Delsarte's linear programming method. The proofs rely on
the analysis of eigenvectors of some finite-dimensional operators related to
orthogonal polynomials. The examples of the method considered in the paper
include binary codes, binary constant-weight codes, spherical codes, and codes
in the projective spaces.Comment: 11 pages, submitte
Lower bounds for measurable chromatic numbers
The Lovasz theta function provides a lower bound for the chromatic number of
finite graphs based on the solution of a semidefinite program. In this paper we
generalize it so that it gives a lower bound for the measurable chromatic
number of distance graphs on compact metric spaces.
In particular we consider distance graphs on the unit sphere. There we
transform the original infinite semidefinite program into an infinite linear
program which then turns out to be an extremal question about Jacobi
polynomials which we solve explicitly in the limit. As an application we derive
new lower bounds for the measurable chromatic number of the Euclidean space in
dimensions 10,..., 24, and we give a new proof that it grows exponentially with
the dimension.Comment: 18 pages, (v3) Section 8 revised and some corrections, to appear in
Geometric and Functional Analysi
The strong thirteen spheres problem
The thirteen spheres problem is asking if 13 equal size nonoverlapping
spheres in three dimensions can touch another sphere of the same size. This
problem was the subject of the famous discussion between Isaac Newton and David
Gregory in 1694. The problem was solved by Schutte and van der Waerden only in
1953.
A natural extension of this problem is the strong thirteen spheres problem
(or the Tammes problem for 13 points) which asks to find an arrangement and the
maximum radius of 13 equal size nonoverlapping spheres touching the unit
sphere. In the paper we give a solution of this long-standing open problem in
geometry. Our computer-assisted proof is based on a enumeration of the
so-called irreducible graphs.Comment: Modified lemma 2, 16 pages, 12 figures. Uploaded program packag
Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
We study asymptotic lower and upper bounds for the sizes of constant
dimension codes with respect to the subspace or injection distance, which is
used in random linear network coding. In this context we review known upper
bounds and show relations between them. A slightly improved version of the
so-called linkage construction is presented which is e.g. used to construct
constant dimension codes with subspace distance , dimension of the
codewords for all field sizes , and sufficiently large dimensions of the
ambient space, that exceed the MRD bound, for codes containing a lifted MRD
code, by Etzion and Silberstein.Comment: 30 pages, 3 table
- âŠ